Search results for "stochastic optimization."
showing 10 items of 37 documents
Stability analysis for stochastic hybrid systems: A survey
2014
This survey addresses stability analysis for stochastic hybrid systems (SHS), which are dynamical systems that combine continuous change and instantaneous change and that also include random effects. We re-emphasize the common features found in most of the models that have appeared in the literature, which include stochastic switched systems, Markov jump systems, impulsive stochastic systems, switching diffusions, stochastic impulsive systems driven by renewal processes, diffusions driven by Lévy processes, piecewise-deterministic Markov processes, general stochastic hybrid systems, and stochastic hybrid inclusions. Then we review many of the stability concepts that have been studied, inclu…
Dissipativity-Based Small-Gain Theorems for Stochastic Network Systems
2016
In this paper, some small-gain theorems are proposed for stochastic network systems which describe large-scale systems with interconnections, uncertainties and random disturbances. By the aid of conditional dissipativity and showing times of stochastic interval, small-gain conditions proposed for the deterministic case are extended to the stochastic case. When some design parameters are tunable in practice, we invaginate a simpler method to verify small-gain condition by selecting one subsystem as a monitor. Compared with the existing results, the existence-and-uniqueness of solution and ultimate uniform boundedness of input are removed from requirements of input-to-state stability and smal…
Stochastic Control Problems
2003
The general theory of stochastic processes originated in the fundamental works of A. N. Kolmogorov and A. Ya. Khincin at the beginning of the 1930s. Kolmogorov, 1938 gave a systematic and rigorous construction of the theory of stochastic processes without aftereffects or, as it is customary to say nowadays, Markov processes. In a number of works, Khincin created the principles of the theory of so-called stationary processes.
Feature selection: A multi-objective stochastic optimization approach
2020
The feature subset task can be cast as a multiobjective discrete optimization problem. In this work, we study the search algorithm component of a feature subset selection method. We propose an algorithm based on the threshold accepting method, extended to the multi-objective framework by an appropriate definition of the acceptance rule. The method is used in the task of identifying relevant subsets of features in a Web bot recognition problem, where automated software agents on the Web are identified by analyzing the stream of HTTP requests to a Web server.
One- and multi-locus multi-allele selection models in a random environment
1979
We deduce conditions for stochastic local stability of general perturbed linear stochastic difference equations widely applicable in population genetics. The findings are adapted to evaluate the stability properties of equilibria in classical one- and multi-locus multi-allele selection models influenced by random temporal variation in selection intensities. As an example of some conclusions and biological interpretations we analyse a special one-locus multi-allele model in more detail.
Mode-superposition correction method for deterministic and stochastic analysis of structural systems
2001
The role played by the modal analysis in the framework of structural dynamics is fundamental from both deterministic and stochastic point of view. However the accuracy obtained by means of the classical modal analysis is not always satisfactory. Therefore it is clear the importance of methods able to correct the modal response in such a way to obtain the required accuracy. Many methods have been proposed in the last years but they are meaningful only when the forcing function is expressed by an analytical function. Moreover in stochastic analysis they fail for white noise excitation. In the paper a method able to give a very accurate response for both deterministic and stochastic input is p…
OnMLM: An Online Formulation for the Minimal Learning Machine
2019
Minimal Learning Machine (MLM) is a nonlinear learning algorithm designed to work on both classification and regression tasks. In its original formulation, MLM builds a linear mapping between distance matrices in the input and output spaces using the Ordinary Least Squares (OLS) algorithm. Although the OLS algorithm is a very efficient choice, when it comes to applications in big data and streams of data, online learning is more scalable and thus applicable. In that regard, our objective of this work is to propose an online version of the MLM. The Online Minimal Learning Machine (OnMLM), a new MLM-based formulation capable of online and incremental learning. The achievements of OnMLM in our…
Learning Automata-Based Solutions to Stochastic Nonlinear Resource Allocation Problems
2009
“Computational Intelligence” is an extremely wide-ranging and all-encompassing area. However, it is fair to say that the strength of a system that possesses “Computational Intelligence” can be quantified by its ability to solve problems that are intrinsically hard. One such class of NP-Hard problems concerns the so-called family of Knapsack Problems, and in this Chapter, we shall explain how a sub-field of Artificial Intelligence, namely that which involves “Learning Automata”, can be used to produce fast and accurate solutions to “difficult” and randomized versions of the Knapsack problem (KP).
Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
2011
We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of ch…
SpaceScanner: COPASI wrapper for automated management of global stochastic optimization experiments
2017
Abstract Motivation Due to their universal applicability, global stochastic optimization methods are popular for designing improvements of biochemical networks. The drawbacks of global stochastic optimization methods are: (i) no guarantee of finding global optima, (ii) no clear optimization run termination criteria and (iii) no criteria to detect stagnation of an optimization run. The impact of these drawbacks can be partly compensated by manual work that becomes inefficient when the solution space is large due to combinatorial explosion of adjustable parameters or for other reasons. Results SpaceScanner uses parallel optimization runs for automatic termination of optimization tasks in case…